Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
1	CHARACTERIZING A VERTEX-TRANSITIVE GRAPH BY A LARGE BALL MIKAEL DE LA SALLE AND ROMAIN TESSERA, WITH AN APPENDIX BY JEAN-CLAUDE SIKORAV Abstract. It is well-known that a complete Riemannian manifold M which is locally is Add to Reading List Source URL: www.normalesup.org Language: English - Date: 2015-12-08 04:58:57 Mathematics Graph theory Geometry Geometric group theory Group theory Metric geometry Algebraic graph theory Cayley graph Quasi-isometry End Vertex-transitive graph Graph
2	Enumeration September 17, How many ways can you colour the complete graph with n colours? 2. How many compositions of n are there? 3. How many compositions of n into k parts? 4. How many weak compositions into k Add to Reading List Source URL: math.colorado.edu - Date: 2015-12-04 19:21:55
3	Using MVAPICH2-GDR for multi-GPU data parallel graph analytics T. James Lewis SYSTAP™, LLC © All Rights Reserved Add to Reading List Source URL: mug.mvapich.cse.ohio-state.edu Language: English - Date: 2015-11-20 13:17:47 Graph theory Mathematics Search algorithms Graph traversal Breadth-first search Vertex NP-complete problems Graph coloring Planar graphs Depth-first search
4	Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2012-01-04 04:27:26 Graph theory Bipartite graphs Planar graphs Induced path NP-complete problems Parity graph
5	A semidefinite programming hierarchy for geometric packing problems David de Laat Joint work with Fernando M. de Oliveira Filho and Frank Vallentin DIAMANT Symposium – November 2012 Add to Reading List Source URL: www.daviddelaat.nl Language: English Graph theory Mathematics NP-complete problems Information theory Combinatorial optimization NP-hard problems Lovsz number Independent set
6	Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:25 Computational complexity theory Complexity classes NP-complete problems Operations research Combinatorial optimization Mathematical optimization Knapsack problem Reduction Graph coloring NP-hardness NP Optimization problem
7	A Fresh Look on Knowledge Bases: Distilling Named Events from News Erdal Kuzey Jilles Vreeken Add to Reading List Source URL: eda.mmci.uni-saarland.de Language: English - Date: 2014-10-01 09:01:01 Graph theory Mathematics NP-complete problems Network theory Networks Combinatorial optimization Semantic similarity Line graph Centrality Matching Dominating set Graph partition
8	TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems Add to Reading List Source URL: www.ads.tuwien.ac.at Language: English - Date: 2015-02-11 08:09:39 Graph theory Operations research Mathematics Computational complexity theory Network flow NP-complete problems NP-hard problems Travelling salesman problem Multi-commodity flow problem Flow network
9	New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ Archontia C. Giannopoulou and George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK archont Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2015-03-12 21:45:21 Graph theory NP-complete problems Graph coloring Dominating set Graph Chordal graph Pathwidth Trapezoid graph

UPDATE